منابع مشابه
Action Refinement for Probabilistic Processes with True Concurrency Models
In this paper, we develop techniques of action refinement for probabilistic processes within the context of a probabilistic process algebra. A semantic counterpart is carried out in a non-interleaving causality based setting, probabilistic bundle event structures. We show that our refinement notion has the following nice properties: the behaviour of the refined system can be inferred compositio...
متن کاملProbabilistic true-concurrency models: Markov nets and a Law of large numbers
We introduce the model of Markov nets, a probabilistic extension of safe Petri nets under the true-concurrency semantics—this means that traces, not firing sequences, are given a probability. This model builds upon our previous work on probabilistic event structures. We use the notion of branching cell for event structures and show that the latter provides the adequate notion of local state, fo...
متن کاملProbabilistic True-Concurrency Models Branching Cells and Distributed Probabilities for Event Structures
This paper is devoted to true-concurrency models for probabilistic systems. By this we mean probabilistic models in which Mazurkiewicz traces, not interleavings, are given a probability. Here we address probabilistic event structures. We consider a new class of event structures, called locally finite. Locally finite event structures exhibit “finite confusion”; in particular, under some mild con...
متن کاملProbabilistic models for true-concurrency: branching cells and distributed probabilities for event structures
This paper is devoted to true-concurrency models for probabilistic systems. By this we mean probabilistic models in which Mazurkiewicz traces, not interleavings, are given a probability. Here we address probabilistic event structures. We consider a new class of event structures, called locally finite. Locally finite event structures exhibit “finite confusion”; in particular, under some mild con...
متن کاملTrue-concurrency probabilistic models: Markov nets and a law of large numbers
We introduce the model of Markov nets, a probabilistic extension of safe Petri nets under the true-concurrency semantics—this means that traces, not firing sequences, are given a probability. This model builds upon our previous work on probabilistic event structures. We use the notion of branching cell for event structures and show that the latter provides the adequate notion of local state, fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2006
ISSN: 0890-5401
DOI: 10.1016/j.ic.2005.10.001